Overview Of Streaming-Data Algorithms
نویسندگان
چکیده
منابع مشابه
Overview of streaming-data algorithms
Due to recent advances in data collection techniques, massive amounts of data are being collected at an extremely fast pace. Also, these data are potentially unbounded. Boundless streams of data collected from sensors, equipments, and other data sources are referred to as data streams. Various data mining tasks can be performed on data streams in search of interesting patterns. This paper studi...
متن کاملFuzzy Data Envelopment Analysis for Classification of Streaming Data
The classification of fuzzy uncertain data is considered one of the most challenging issues in data analysis. In spite of the significance of fuzzy data in mathematical programming, the development of the analytical methods of fuzzy data is slow. Therefore, the current study proposes a new fuzzy data classification method based on fuzzy data envelopment analysis (DEA) which can handle strea...
متن کاملFuzzy Data Envelopment Analysis for Classification of Streaming Data
The classification of fuzzy uncertain data is considered one of the most challenging issues in data analysis. In spite of the significance of fuzzy data in mathematical programming, the development of the analytical methods of fuzzy data is slow. Therefore, the current study proposes a new fuzzy data classification method based on fuzzy data envelopment analysis (DEA) which can handle strea...
متن کاملData Streaming Algorithms for Geometric Problems
A data stream is an ordered sequence of points that can be read only once or a small number of times. Formally, a data stream is a sequence of points x1, x2 . . . , xi, . . . , xn read in increasing order of the indices i. The performance of the algorithm is measured on the number of passes the algorithm must make over the data under limited memory constraints. The data streaming model is motiv...
متن کاملStreaming-Data Algorithms for High-Quality Clustering
Streaming data analysis has recently attracted attention in numerous applications including telephone records, web documents and clickstreams. For such analysis, single-pass algorithms that consume a small amount of memory are critical. We describe such a streaming algorithm that e ectively clusters large data streams. We also provide empirical evidence of the algorithm's performance on synthet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advanced Computing: An International Journal
سال: 2011
ISSN: 2229-726X
DOI: 10.5121/acij.2011.2614